Probabilistic analysis for scheduling with conflicts
نویسندگان
چکیده
منابع مشابه
Probabilistic Analysis for Scheduling with Con icts
In this paper, we consider scheduling jobs that may be competing for mutually exclusive resources. We model the connicts between jobs with a connict graph, so that all concurrently running jobs must form an independent set in the graph. Our goal is to bound the maximum response time of any job in the system. We adopt a discrete model of time and assume that each job requires one time unit to be...
متن کاملScheduling with Conflicts
We consider the following problem of scheduling with conflicts (SWC): Find a minimum makespan schedule on a constant number of identical machines where conflicting jobs may not be scheduled concurrently. We present the first approximation algorithms for the case in which conflicts between jobs are modeled by general graphs both for unit jobs and jobs with arbitrary processing times. Previous re...
متن کامل1D Vehicle Scheduling with Conflicts
Systems of rail-mounted vehicles play a key role in many logistics applications, and the efficiency of their operation frequently has a significant impact on the overall performance of the surrounding production environment. In theory, assigning transport requests to the vehicles of such systems and scheduling their execution amounts to finding k tours on a common line, where tours may never cr...
متن کاملProbabilistic Analysis for Mixed Criticality Scheduling with SMC and AMC
This paper introduces probabilistic analysis for fixed priority preemptive scheduling of mixed criticality systems on a uniprocessor using the Adaptive Mixed Criticality (AMC) and Static Mixed Criticality (SMC) schemes. We compare this analysis to the equivalent deterministic methods, highlighting the performance gains that can be obtained by utilising more detailed information about worst-case...
متن کاملScheduling with conflicts: online and offline algorithms
We consider the following problem of scheduling with conflicts (SWC): Find a minimum makespan schedule on identical machines where conflicting jobs cannot be scheduled concurrently. We study the problem when conflicts between jobs are modeled by general graphs. Our first main positive result is an exact algorithm for two machines and job sizes in {1, 2}. For jobs sizes in {1, 2, 3}, we can obta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.01.027